Uniformly balanced words with linear complexity and prescribed letter frequencies
نویسندگان
چکیده
We consider the following problem. Let us fix a finite alphabet A = {1,2, · · · ,d}; for any d-uple of letter frequencies ( f1, · · · , fd) ∈ [0,1]d with ∑i=1 fi = 1, how to construct an infinite word u over the alphabet A satisfying the following conditions: u has linear complexity function, u is uniformly balanced, the letter frequencies in u are given by ( f1, · · · , fd). This paper investigates a construction method for such words based on the use of mixed multidimensional continued fraction algorithms.
منابع مشابه
Permutation Complexity Related to the Letter Doubling Map
Given a countable set X (usually taken to be N or Z), an infinite permutation π of X is a linear ordering ≺π of X , introduced in [6]. This paper investigates the combinatorial complexity of infinite permutations on N associated with the image of uniformly recurrent aperiodic binary words under the letter doubling map. An upper bound for the complexity is found for general words, and a formula ...
متن کاملOn the Entropy and Letter Frequencies of Ternary Square-Free Words
We enumerate all ternary length-` square-free words, which are words avoiding squares of words up to length `, for ` ≤ 24. We analyse the singular behaviour of the corresponding generating functions. This leads to new upper entropy bounds for ternary square-free words. We then consider ternary square-free words with fixed letter densities, thereby proving exponential growth for certain ensemble...
متن کاملm-Balanced words: A generalization of balanced words
Consider to construct an in5nite sequence, or an in5nite word, from a 5nite set of letters such as each letter is distributed with “good balance,” that is, as evenly as possible, when the densities of letters are provided. Such words have been applied to many scheduling and routing problems in various areas. Concerning the balancedness of words, the notions of regularity and balanced words have...
متن کاملm-Balanced Sequences and Their Applications to Some Network Scheduling Problems
Consider to construct an infinite sequence from a finite set of letters such as each letter is distributed with “good balance,” that is, as uniformly as possible, and with a fixed rate. Such sequences have been applied to many scheduling and routing problems in the area of queueing/discrete-event systems. Concerning the balancedness of sequences, the notions of regularity and balanced sequences...
متن کاملOn the Entropy and Letter Frequencies of Powerfree Words
We review the recent progress in the investigation of powerfree words, with particular emphasis on binary cubefree and ternary squarefree words. Besides various bounds on the entropy, we provide bounds on letter frequencies and consider their empirical distribution obtained by an enumeration of binary cubefree words up to length 80.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011